Delta-crossing number for knots
نویسندگان
چکیده
منابع مشابه
On Crossing Number of Knots
The aim of this paper is to endow a monoid structure on the set S of all oriented knots(links) under the operation ⊎ , called addition of knots. Moreover, we prove that there exists a homomorphism of monoids between (Sd, ⊎ ) to (N, +), where Sd is a subset of S with an extra condition and N is the monoid of non negative integers under usual addition.
متن کاملTriple Crossing Number of Knots and Links
A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove that every knot and link has a triple crossing projection and then investigate c3(K), which is the minimum number of triple crossings in a projection of K. We o...
متن کاملThe Crossing Number of Composite Knots
One of the most basic questions in knot theory remains unresolved: is crossing number additive under connected sum? In other words, does the equality c(K1♯K2) = c(K1) + c(K2) always hold, where c(K) denotes the crossing number of a knot K and K1♯K2 is the connected sum of two (oriented) knots K1 and K2? The inequality c(K1♯K2) ≤ c(K1) + c(K2) is trivial, but very little more is known in general...
متن کاملDoubly slice knots with low crossing number
A knot in S is doubly slice if it is the cross-section of an unknotted two-sphere in S. For low-crossing knots, the most complete work to date gives a classification of doubly slice knots through 9 crossings. We extend that work through 12 crossings, resolving all but four cases among the 2,977 prime knots in that range. The techniques involved in this analysis include considerations of the Ale...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2015
ISSN: 0166-8641
DOI: 10.1016/j.topol.2015.05.044